Veriication of Ieee Compliant Subtractive Division Algorithms
نویسنده
چکیده
A parameterized deenition of subtractive oating point division algorithms is presented and veriied using PVS. The general algorithm is proven to satisfy a formal deenition of an IEEE standard for oating point arithmetic. The utility of the general speciication is illustrated using a number of diierent instances of the general algorithm.
منابع مشابه
Verification of IEEE Compliant Subtractive Division Algorithms
A parameterized deenition of subtractive oating point division algorithms is presented and veriied using PVS. The general algorithm is proven to satisfy a formal deenition of an IEEE standard for oating point arithmetic. The utility of the general speciication is illustrated using a number of diierent instances of the general algorithm.
متن کاملVeri cation of IEEE Compliant Subtractive Division Algorithms
A parameterized de nition of subtractive oating point division algorithms is presented and veri ed using PVS. The general algorithm is proven to satisfy a formal de nition of an IEEE standard for oating point arithmetic. The utility of the general speci cation is illustrated using a number of di erent instances of the general algorithm.
متن کاملDesign Structures for Formally Veri ed Floating Point Units
A design structure is presented to assist in the design of IEEE compliant oating point hardware. The basis of the process is an abstraction of the bitwise operations found in hardware to reals and integers. This simpliies the deenition of functionality prior to going to hardware. The nal design structure will include a set of general algorithms deened for oating point operations (add, sub, mult...
متن کاملFast Ieee Rounding for Division by Functional Iteration
A class of high performance division algorithms is functional iteration. Division by functional iteration uses multiplication as the fundamental operator. The main advantage of division by functional iteration is quadratic convergence to the quotient. However, unlike non-restoring division algorithms such as SRT division, functional iteration does not directly provide a nal remainder. This make...
متن کاملAn Area/Performance Comparison of Subtractive and Multiplicative Divide/Square Root Implementations
The implementations of division and square root in the FPU’s of current microprocessors are based on one of two categories of algorithms. Multiplicative techniques, exemplified by the Newton-Raphson method and Goldschmidt’s algorithm, share functionality with the floatingpoint multiplier. Subtractive methods, such as the many variations of radix-4 SRT, generally use dedicated, parallel hardware...
متن کامل